<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>QSculpt: engine/include/OctreeNode.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">QSculpt
   &#160;<span id="projectnumber">0.0.1a</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<div class="title">engine/include/OctreeNode.h</div>  </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/***************************************************************************</span>
<a name="l00002"></a>00002 <span class="comment"> *   Copyright (C) 2007 by Juan Roberto Cabral Flores   *</span>
<a name="l00003"></a>00003 <span class="comment"> *   roberto.cabral@gmail.com   *</span>
<a name="l00004"></a>00004 <span class="comment"> *                                                                         *</span>
<a name="l00005"></a>00005 <span class="comment"> *   This program is free software; you can redistribute it and/or modify  *</span>
<a name="l00006"></a>00006 <span class="comment"> *   it under the terms of the GNU General Public License as published by  *</span>
<a name="l00007"></a>00007 <span class="comment"> *   the Free Software Foundation; either version 2 of the License, or     *</span>
<a name="l00008"></a>00008 <span class="comment"> *   (at your option) any later version.                                   *</span>
<a name="l00009"></a>00009 <span class="comment"> *                                                                         *</span>
<a name="l00010"></a>00010 <span class="comment"> *   This program is distributed in the hope that it will be useful,       *</span>
<a name="l00011"></a>00011 <span class="comment"> *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *</span>
<a name="l00012"></a>00012 <span class="comment"> *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *</span>
<a name="l00013"></a>00013 <span class="comment"> *   GNU General Public License for more details.                          *</span>
<a name="l00014"></a>00014 <span class="comment"> *                                                                         *</span>
<a name="l00015"></a>00015 <span class="comment"> *   You should have received a copy of the GNU General Public License     *</span>
<a name="l00016"></a>00016 <span class="comment"> *   along with this program; if not, write to the                         *</span>
<a name="l00017"></a>00017 <span class="comment"> *   Free Software Foundation, Inc.,                                       *</span>
<a name="l00018"></a>00018 <span class="comment"> *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *</span>
<a name="l00019"></a>00019 <span class="comment"> ***************************************************************************/</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef OCTREENODE_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define OCTREENODE_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include &quot;ICollection.h&quot;</span>
<a name="l00025"></a>00025 
<a name="l00026"></a>00026 <span class="keyword">using namespace </span>data;
<a name="l00027"></a>00027 
<a name="l00028"></a>00028 <span class="keyword">namespace </span>data {
<a name="l00029"></a>00029     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> D &gt;
<a name="l00030"></a><a class="code" href="classdata_1_1_octree_node.html">00030</a>     <span class="keyword">class </span><a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a> {
<a name="l00031"></a>00031         <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> MaxVertex = 4;
<a name="l00032"></a>00032         <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> MaxDepth = 50;
<a name="l00033"></a>00033     <span class="keyword">public</span>:
<a name="l00034"></a>00034         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>(<a class="code" href="classdata_1_1_i_collection.html">ICollection&lt;D&gt;</a>* octree);
<a name="l00035"></a>00035         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>(<a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* parent, <span class="keywordtype">int</span> depth = 0);
<a name="l00036"></a>00036         ~<a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>();
<a name="l00037"></a>00037         
<a name="l00038"></a>00038         <span class="keyword">inline</span> <span class="keywordtype">void</span> setMinimumCoords(<span class="keyword">const</span> Point3&amp; v);
<a name="l00039"></a>00039         <span class="keyword">inline</span> Point3 getMinimumCoords();
<a name="l00040"></a>00040         <span class="keyword">inline</span> <span class="keywordtype">void</span> setMaximumCoords(<span class="keyword">const</span> Point3&amp; v);
<a name="l00041"></a>00041         <span class="keyword">inline</span> Point3 getMaximumCoords();
<a name="l00042"></a>00042         <span class="keywordtype">bool</span> findClosest(<span class="keyword">const</span> Point3&amp; v, D* data) ;
<a name="l00043"></a>00043         <span class="keywordtype">int</span> indexOf(<span class="keyword">const</span> D&amp; data);
<a name="l00044"></a>00044         <span class="keyword">inline</span> <span class="keywordtype">bool</span> contains(<span class="keyword">const</span> D&amp; data);
<a name="l00045"></a>00045         <span class="keywordtype">bool</span> add(<span class="keyword">const</span> D&amp; data) ;
<a name="l00046"></a>00046         <span class="keywordtype">bool</span> <span class="keyword">remove</span>(<span class="keyword">const</span> D&amp;);
<a name="l00047"></a>00047         <span class="keywordtype">void</span> clear();
<a name="l00048"></a>00048         
<a name="l00049"></a>00049         QString toString();
<a name="l00050"></a>00050         
<a name="l00051"></a>00051     <span class="keyword">protected</span>:
<a name="l00052"></a>00052         <span class="keywordtype">void</span> doPartition();
<a name="l00053"></a>00053         
<a name="l00054"></a>00054         <span class="keywordtype">bool</span> isInVolume(<span class="keyword">const</span> D&amp; v);
<a name="l00055"></a>00055         
<a name="l00056"></a>00056     <span class="keyword">private</span>:
<a name="l00057"></a>00057         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>(<span class="keyword">const</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>&amp;);
<a name="l00058"></a>00058         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>&amp; operator=(<span class="keyword">const</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>&amp;);
<a name="l00059"></a>00059         
<a name="l00060"></a>00060         <a class="code" href="classdata_1_1_i_collection.html">ICollection&lt;D&gt;</a>*         m_octree;           <span class="comment">// Pointer to owner octree</span>
<a name="l00061"></a>00061         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>*          m_parent;           <span class="comment">// Pointer to parent node</span>
<a name="l00062"></a>00062         QVector&lt;OctreeNode&lt;D&gt;*&gt; m_childrenNodes;    <span class="comment">// Children nodes.</span>
<a name="l00063"></a>00063         QVector&lt;int&gt;            m_dataIndices;  <span class="comment">//</span>
<a name="l00064"></a>00064         Point3                  m_minimumCoords;
<a name="l00065"></a>00065         Point3                  m_maximumCoords;
<a name="l00066"></a>00066         <span class="keywordtype">bool</span>                    m_hasChildren;
<a name="l00067"></a>00067         <span class="keywordtype">int</span>                     m_depth;
<a name="l00068"></a>00068     };
<a name="l00069"></a>00069     
<a name="l00070"></a>00070     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00071"></a>00071     <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt; D &gt;::OctreeNode</a>(<a class="code" href="classdata_1_1_i_collection.html">ICollection&lt;D&gt;</a>* octree)
<a name="l00072"></a>00072     : m_octree(octree),
<a name="l00073"></a>00073     m_parent(NULL),
<a name="l00074"></a>00074     m_hasChildren(false),
<a name="l00075"></a>00075     m_depth (0)
<a name="l00076"></a>00076     {
<a name="l00077"></a>00077         <span class="comment">//    m_minimumCoords = Vertex::null();</span>
<a name="l00078"></a>00078         <span class="comment">//    m_maximumCoords = Vertex::null();</span>
<a name="l00079"></a>00079     }
<a name="l00080"></a>00080     
<a name="l00081"></a>00081     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00082"></a>00082     <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::OctreeNode</a>(<a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* parent, <span class="keywordtype">int</span> depth)
<a name="l00083"></a>00083     : m_parent(parent),
<a name="l00084"></a>00084     m_hasChildren(false),
<a name="l00085"></a>00085     m_depth (depth)
<a name="l00086"></a>00086     {
<a name="l00087"></a>00087         m_octree = m_parent != NULL ? m_parent-&gt;m_octree : NULL;
<a name="l00088"></a>00088         <span class="comment">//    m_minimumCoords = Vertex::null();</span>
<a name="l00089"></a>00089         <span class="comment">//    m_maximumCoords = Vertex::null();</span>
<a name="l00090"></a>00090     }
<a name="l00091"></a>00091     
<a name="l00092"></a>00092     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00093"></a>00093     <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::~OctreeNode</a>()
<a name="l00094"></a>00094     {
<a name="l00095"></a>00095         clear();
<a name="l00096"></a>00096     }
<a name="l00097"></a>00097     
<a name="l00098"></a>00098     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00099"></a>00099     <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::setMinimumCoords</a>(<span class="keyword">const</span> Point3&amp; v)
<a name="l00100"></a>00100     {
<a name="l00101"></a>00101         m_minimumCoords = v;
<a name="l00102"></a>00102     }
<a name="l00103"></a>00103     
<a name="l00104"></a>00104     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00105"></a>00105     <span class="keyword">inline</span> Point3 <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::getMinimumCoords</a>()
<a name="l00106"></a>00106     {
<a name="l00107"></a>00107         <span class="keywordflow">return</span> m_minimumCoords;
<a name="l00108"></a>00108     }
<a name="l00109"></a>00109     
<a name="l00110"></a>00110     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00111"></a>00111     <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::setMaximumCoords</a>(<span class="keyword">const</span> Point3&amp; v)
<a name="l00112"></a>00112     {
<a name="l00113"></a>00113         m_maximumCoords = v;
<a name="l00114"></a>00114     }
<a name="l00115"></a>00115     
<a name="l00116"></a>00116     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00117"></a>00117     <span class="keyword">inline</span> Point3 <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::getMaximumCoords</a>()
<a name="l00118"></a>00118     {
<a name="l00119"></a>00119         <span class="keywordflow">return</span> m_maximumCoords;
<a name="l00120"></a>00120     }
<a name="l00121"></a>00121     
<a name="l00122"></a>00122     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00123"></a>00123     <span class="keywordtype">void</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::clear</a>()
<a name="l00124"></a>00124     {
<a name="l00125"></a>00125         <span class="keywordtype">int</span> size = m_childrenNodes.size();
<a name="l00126"></a>00126         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* d = NULL;
<a name="l00127"></a>00127         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {
<a name="l00128"></a>00128             d = m_childrenNodes[i];
<a name="l00129"></a>00129             <span class="keywordflow">if</span> (d) {
<a name="l00130"></a>00130                 d-&gt;clear();
<a name="l00131"></a>00131                 <span class="keyword">delete</span> d;
<a name="l00132"></a>00132             }
<a name="l00133"></a>00133         }
<a name="l00134"></a>00134         m_childrenNodes.clear();
<a name="l00135"></a>00135         m_dataIndices.clear();
<a name="l00136"></a>00136     }
<a name="l00137"></a>00137     
<a name="l00138"></a>00138     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00139"></a>00139     <span class="keywordtype">bool</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::findClosest</a>(<span class="keyword">const</span> Point3&amp; v, D* data)
<a name="l00140"></a>00140     {
<a name="l00141"></a>00141         <span class="keywordflow">if</span> (data == NULL)
<a name="l00142"></a>00142             <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00143"></a>00143         
<a name="l00144"></a>00144         <span class="comment">//if (!isInVolume(v))</span>
<a name="l00145"></a>00145         <span class="comment">//  return Vertex::null();;</span>
<a name="l00146"></a>00146         
<a name="l00147"></a>00147         <span class="keywordflow">if</span> (m_hasChildren) {
<a name="l00148"></a>00148             <span class="keywordtype">bool</span> res;
<a name="l00149"></a>00149             <span class="keywordflow">foreach</span>(<a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* node, m_childrenNodes) {
<a name="l00150"></a>00150                 res = node-&gt;findClosest(v, data);
<a name="l00151"></a>00151                 <span class="keywordflow">if</span> (res) {
<a name="l00152"></a>00152                     <span class="keywordflow">return</span> res;
<a name="l00153"></a>00153                 }
<a name="l00154"></a>00154             }
<a name="l00155"></a>00155         }
<a name="l00156"></a>00156         <span class="keywordflow">else</span> {
<a name="l00157"></a>00157             <span class="keywordflow">if</span> (m_dataIndices.isEmpty())
<a name="l00158"></a>00158                 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00159"></a>00159             
<a name="l00160"></a>00160             <span class="keywordtype">double</span> distance = 0.0, minDistance = -1.0;
<a name="l00161"></a>00161             <span class="keywordtype">int</span> i = 0, indexOf = 0, dataSize = m_dataIndices.size();
<a name="l00162"></a>00162             qDebug(<span class="stringliteral">&quot;OctreeNode: dataSize = %d&quot;</span>, dataSize);
<a name="l00163"></a>00163             D tmp;
<a name="l00164"></a>00164             <span class="keywordflow">do</span> {
<a name="l00165"></a>00165                 tmp = m_octree-&gt;toQVector().at(m_dataIndices[i]);
<a name="l00166"></a>00166                 distance = (v - tmp).length();
<a name="l00167"></a>00167                 <span class="keywordflow">if</span> (distance &lt;= minDistance || minDistance &lt; 0.0) {
<a name="l00168"></a>00168                     minDistance = distance;
<a name="l00169"></a>00169                     indexOf = m_dataIndices[i];
<a name="l00170"></a>00170                 }
<a name="l00171"></a>00171                 ++i;
<a name="l00172"></a>00172             } <span class="keywordflow">while</span>(i &lt; dataSize);
<a name="l00173"></a>00173             *data = m_octree-&gt;toQVector().at(indexOf);
<a name="l00174"></a>00174             <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00175"></a>00175         }
<a name="l00176"></a>00176         <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00177"></a>00177     }
<a name="l00178"></a>00178     
<a name="l00179"></a>00179     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00180"></a>00180     <span class="keywordtype">int</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::indexOf</a>(<span class="keyword">const</span> D&amp; data)
<a name="l00181"></a>00181     {
<a name="l00182"></a>00182         <span class="keywordtype">int</span> index = -1;
<a name="l00183"></a>00183         
<a name="l00184"></a>00184         <span class="comment">//if (data == D::null()) {</span>
<a name="l00185"></a>00185         <span class="comment">//  qDebug(&quot;OctreeNode::indexOf: Vertex cannot be null()&quot;);</span>
<a name="l00186"></a>00186         <span class="comment">//  return false;</span>
<a name="l00187"></a>00187         <span class="comment">//}</span>
<a name="l00188"></a>00188         
<a name="l00189"></a>00189         <span class="keywordflow">if</span> (!isInVolume(data))
<a name="l00190"></a>00190             <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00191"></a>00191         
<a name="l00192"></a>00192         <span class="keywordflow">if</span> (m_hasChildren) {
<a name="l00193"></a>00193             <span class="keywordflow">if</span> (m_childrenNodes.isEmpty())
<a name="l00194"></a>00194                 <span class="keywordflow">return</span> index;
<a name="l00195"></a>00195             
<a name="l00196"></a>00196             <span class="keywordtype">int</span> size = m_childrenNodes.size();
<a name="l00197"></a>00197             <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {
<a name="l00198"></a>00198                 index = m_childrenNodes[i]-&gt;indexOf(data);
<a name="l00199"></a>00199                 <span class="keywordflow">if</span> (index)
<a name="l00200"></a>00200                     <span class="keywordflow">break</span>;
<a name="l00201"></a>00201             }
<a name="l00202"></a>00202         }
<a name="l00203"></a>00203         <span class="keywordflow">else</span> {
<a name="l00204"></a>00204             <span class="keywordflow">if</span> (m_dataIndices.isEmpty())
<a name="l00205"></a>00205                 <span class="keywordflow">return</span> index;
<a name="l00206"></a>00206             
<a name="l00207"></a>00207             <span class="keywordtype">int</span> size = m_dataIndices.size();
<a name="l00208"></a>00208             <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {
<a name="l00209"></a>00209                 <span class="keywordflow">if</span> (m_octree-&gt;at(m_dataIndices[i]) == data) {
<a name="l00210"></a>00210                     index = m_dataIndices[i];
<a name="l00211"></a>00211                     <span class="keywordflow">break</span>;
<a name="l00212"></a>00212                 }
<a name="l00213"></a>00213             }
<a name="l00214"></a>00214         }
<a name="l00215"></a>00215         <span class="keywordflow">return</span> index;
<a name="l00216"></a>00216     }
<a name="l00217"></a>00217     
<a name="l00218"></a>00218     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00219"></a>00219     <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::contains</a>(<span class="keyword">const</span> D&amp; data)
<a name="l00220"></a>00220     {
<a name="l00221"></a>00221         <span class="keywordflow">return</span> indexOf(data) != -1;
<a name="l00222"></a>00222     }
<a name="l00223"></a>00223     
<a name="l00224"></a>00224     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00225"></a>00225     <span class="keywordtype">bool</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::add</a>(<span class="keyword">const</span> D&amp; data)
<a name="l00226"></a>00226     {
<a name="l00227"></a>00227         <span class="comment">// TODO: This method doesn&#39;t work, crash!!!</span>
<a name="l00228"></a>00228         <span class="keywordflow">if</span> ( !isInVolume(data) )
<a name="l00229"></a>00229             <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00230"></a>00230         
<a name="l00231"></a>00231         <span class="keywordflow">if</span> ( m_hasChildren ) {
<a name="l00232"></a>00232             <span class="keywordflow">foreach</span>(<a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* n, m_childrenNodes) {
<a name="l00233"></a>00233                 <span class="keywordflow">if</span> ( n-&gt;add(data) )
<a name="l00234"></a>00234                     <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00235"></a>00235             }
<a name="l00236"></a>00236         }
<a name="l00237"></a>00237         <span class="keywordflow">else</span> {
<a name="l00238"></a>00238             <span class="keywordflow">if</span> ( m_dataIndices.size() &lt; MaxVertex || m_depth &gt;= MaxDepth ) {
<a name="l00239"></a>00239                 m_octree-&gt;m_data.append(data);
<a name="l00240"></a>00240                 <span class="keywordtype">int</span> index = m_octree-&gt;m_data.size() - 1;
<a name="l00241"></a>00241                 m_dataIndices.append(index);
<a name="l00242"></a>00242                 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00243"></a>00243             }
<a name="l00244"></a>00244             <span class="keywordflow">else</span> {
<a name="l00245"></a>00245                 doPartition();
<a name="l00246"></a>00246                 <span class="keywordflow">foreach</span>(<a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* n, m_childrenNodes) {
<a name="l00247"></a>00247                     <span class="keywordflow">if</span> ( n-&gt;add(data) )
<a name="l00248"></a>00248                         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00249"></a>00249                 }
<a name="l00250"></a>00250             }
<a name="l00251"></a>00251         }
<a name="l00252"></a>00252         <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00253"></a>00253     }
<a name="l00254"></a>00254     
<a name="l00255"></a>00255     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00256"></a>00256     <span class="keywordtype">void</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::doPartition</a>()
<a name="l00257"></a>00257     {
<a name="l00258"></a>00258         Vector3 delta = (m_maximumCoords - m_minimumCoords) / 2.0f;
<a name="l00259"></a>00259         
<a name="l00260"></a>00260         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>* node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00261"></a>00261         node-&gt;setMinimumCoords(m_minimumCoords);
<a name="l00262"></a>00262         node-&gt;setMaximumCoords(m_minimumCoords + delta);
<a name="l00263"></a>00263         m_childrenNodes.append(node);
<a name="l00264"></a>00264         
<a name="l00265"></a>00265         Point3 tmp = m_minimumCoords;
<a name="l00266"></a>00266         tmp.x() += delta.x();
<a name="l00267"></a>00267         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00268"></a>00268         node-&gt;setMinimumCoords(tmp);
<a name="l00269"></a>00269         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00270"></a>00270         m_childrenNodes.append(node);
<a name="l00271"></a>00271         
<a name="l00272"></a>00272         tmp = m_minimumCoords;
<a name="l00273"></a>00273         tmp.x() += delta.x();
<a name="l00274"></a>00274         tmp.y() += delta.y();
<a name="l00275"></a>00275         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00276"></a>00276         node-&gt;setMinimumCoords(tmp);
<a name="l00277"></a>00277         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00278"></a>00278         m_childrenNodes.append(node);
<a name="l00279"></a>00279         
<a name="l00280"></a>00280         tmp = m_minimumCoords;
<a name="l00281"></a>00281         tmp.y() += delta.y();
<a name="l00282"></a>00282         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00283"></a>00283         node-&gt;setMinimumCoords(tmp);
<a name="l00284"></a>00284         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00285"></a>00285         m_childrenNodes.append(node);
<a name="l00286"></a>00286         
<a name="l00287"></a>00287         tmp = m_minimumCoords;
<a name="l00288"></a>00288         tmp.z() += delta.z();
<a name="l00289"></a>00289         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00290"></a>00290         node-&gt;setMinimumCoords(tmp);
<a name="l00291"></a>00291         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00292"></a>00292         m_childrenNodes.append(node);
<a name="l00293"></a>00293         
<a name="l00294"></a>00294         tmp = m_minimumCoords;
<a name="l00295"></a>00295         tmp.x() += delta.x();
<a name="l00296"></a>00296         tmp.z() += delta.z();
<a name="l00297"></a>00297         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00298"></a>00298         node-&gt;setMinimumCoords(tmp);
<a name="l00299"></a>00299         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00300"></a>00300         m_childrenNodes.append(node);
<a name="l00301"></a>00301         
<a name="l00302"></a>00302         tmp = m_minimumCoords;
<a name="l00303"></a>00303         tmp.x() += delta.x();
<a name="l00304"></a>00304         tmp.y() += delta.y();
<a name="l00305"></a>00305         tmp.z() += delta.z();
<a name="l00306"></a>00306         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00307"></a>00307         node-&gt;setMinimumCoords(tmp);
<a name="l00308"></a>00308         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00309"></a>00309         m_childrenNodes.append(node);
<a name="l00310"></a>00310         
<a name="l00311"></a>00311         tmp = m_minimumCoords;
<a name="l00312"></a>00312         tmp.y() += delta.y();
<a name="l00313"></a>00313         tmp.z() += delta.z();
<a name="l00314"></a>00314         node = <span class="keyword">new</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;</a>(<span class="keyword">this</span>, m_depth + 1);
<a name="l00315"></a>00315         node-&gt;setMinimumCoords(tmp);
<a name="l00316"></a>00316         node-&gt;setMaximumCoords(tmp + delta);
<a name="l00317"></a>00317         m_childrenNodes.append(node);
<a name="l00318"></a>00318         
<a name="l00319"></a>00319         <a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>* n;
<a name="l00320"></a>00320         <span class="keywordtype">int</span> dataCount = m_dataIndices.size();
<a name="l00321"></a>00321         <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; dataCount; ++i)
<a name="l00322"></a>00322         {
<a name="l00323"></a>00323             <span class="keywordflow">foreach</span>(n, m_childrenNodes)
<a name="l00324"></a>00324             {
<a name="l00325"></a>00325                 <span class="keywordflow">if</span>(n-&gt;isInVolume(m_octree-&gt;at(m_dataIndices[i])))
<a name="l00326"></a>00326                 {
<a name="l00327"></a>00327                     n-&gt;m_dataIndices.append(m_dataIndices[i]);
<a name="l00328"></a>00328                     <span class="keywordflow">break</span>;
<a name="l00329"></a>00329                 }
<a name="l00330"></a>00330             }
<a name="l00331"></a>00331         }
<a name="l00332"></a>00332         m_dataIndices.clear();
<a name="l00333"></a>00333         m_hasChildren = <span class="keyword">true</span>;
<a name="l00334"></a>00334     }
<a name="l00335"></a>00335     
<a name="l00336"></a>00336     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00337"></a>00337     <span class="keywordtype">bool</span> <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::isInVolume</a>(<span class="keyword">const</span> D&amp; d)
<a name="l00338"></a>00338     {
<a name="l00339"></a>00339         Point3 v = d;
<a name="l00340"></a>00340         <span class="keywordtype">float</span> x = v.x(), y = v.y(), z = v.z();
<a name="l00341"></a>00341         <span class="keywordflow">if</span> ( x &lt; m_minimumCoords.x() || x &gt;= m_maximumCoords.x()
<a name="l00342"></a>00342             || y &lt; m_minimumCoords.y() || y &gt;= m_maximumCoords.y()
<a name="l00343"></a>00343             || z &lt; m_minimumCoords.z() || z &gt;= m_maximumCoords.z()
<a name="l00344"></a>00344             )
<a name="l00345"></a>00345         {
<a name="l00346"></a>00346             <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00347"></a>00347         }
<a name="l00348"></a>00348         
<a name="l00349"></a>00349         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00350"></a>00350     }
<a name="l00351"></a>00351     
<a name="l00352"></a>00352     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> D&gt;
<a name="l00353"></a>00353     QString <a class="code" href="classdata_1_1_octree_node.html">OctreeNode&lt;D&gt;::toString</a>()
<a name="l00354"></a>00354     {
<a name="l00355"></a>00355         QString res;
<a name="l00356"></a>00356         QString indent;
<a name="l00357"></a>00357         <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m_depth; i++)
<a name="l00358"></a>00358             indent+= <span class="stringliteral">&quot;  &quot;</span>;
<a name="l00359"></a>00359         
<a name="l00360"></a>00360         res = indent + <span class="stringliteral">&quot;Node{\n&quot;</span>;
<a name="l00361"></a>00361         res += indent + <span class="stringliteral">&quot;m_depth:&quot;</span> + QString::number(m_depth) + <span class="stringliteral">&quot;\n&quot;</span>;
<a name="l00362"></a>00362         res += indent + <span class="stringliteral">&quot;m_minCoords:&quot;</span> + ::toString(m_minimumCoords) + <span class="stringliteral">&quot;\n&quot;</span>;
<a name="l00363"></a>00363         res += indent + <span class="stringliteral">&quot;m_maxCoords:&quot;</span> + ::toString(m_maximumCoords);
<a name="l00364"></a>00364         qDebug(<span class="stringliteral">&quot;%s&quot;</span>, qPrintable(res));
<a name="l00365"></a>00365         <span class="keywordflow">if</span> (m_hasChildren) {
<a name="l00366"></a>00366             <a class="code" href="classdata_1_1_octree_node.html">OctreeNode</a>* n;
<a name="l00367"></a>00367             res = <span class="stringliteral">&quot;&quot;</span>;
<a name="l00368"></a>00368             <span class="keywordflow">foreach</span>(n, m_childrenNodes)
<a name="l00369"></a>00369             {
<a name="l00370"></a>00370                 res += n-&gt;toString();
<a name="l00371"></a>00371             }
<a name="l00372"></a>00372         }
<a name="l00373"></a>00373         <span class="keywordflow">else</span> {
<a name="l00374"></a>00374             res = <span class="stringliteral">&quot;&quot;</span>;
<a name="l00375"></a>00375             <span class="keywordtype">int</span> i;
<a name="l00376"></a>00376             <span class="keywordflow">foreach</span>(i, m_dataIndices)
<a name="l00377"></a>00377             {
<a name="l00378"></a>00378                 res = indent + <span class="stringliteral">&quot;point[&quot;</span> + QString::number(i)
<a name="l00379"></a>00379                 + <span class="stringliteral">&quot;]:&quot;</span> + ::toString(m_octree-&gt;toQVector()[i]);
<a name="l00380"></a>00380                 qDebug(<span class="stringliteral">&quot;%s&quot;</span>, qPrintable(res));
<a name="l00381"></a>00381             }
<a name="l00382"></a>00382         }
<a name="l00383"></a>00383         qDebug(<span class="stringliteral">&quot;%s&quot;</span>,qPrintable(indent + <span class="stringliteral">&quot;}&quot;</span>));
<a name="l00384"></a>00384         <span class="comment">//res = res + indent + &quot;}\n&quot;;</span>
<a name="l00385"></a>00385         res = <span class="stringliteral">&quot;&quot;</span>;
<a name="l00386"></a>00386         <span class="keywordflow">return</span> res;
<a name="l00387"></a>00387     }
<a name="l00388"></a>00388 }
<a name="l00389"></a>00389 
<a name="l00390"></a>00390 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerator</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Aug 27 2011 15:38:52 for QSculpt by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.5.1
</small></address>

</body>
</html>
